import sys
from types import GeneratorType
input = lambda: sys.stdin.buffer.readline().decode().rstrip()
def bootstrap(f):
stack = []
def wrappedfunc(*args, **kwargs):
if stack:
return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
else:
stack.pop()
if not stack:
break
to = stack[-1].send(to)
return to
return wrappedfunc
mod = 10**9 + 7
def f(i,j) :
if i == n :
return 0
if dp[i][j] != -1:
return dp[i][j]
res = f(i+1,j)
if (arr[i][0] - arr[j][0])**2 + (arr[i][1] - arr[j][1])**2 <= (arr[i][2] - arr[j][2])**2 or j == -1 :
res = max(res, (arr[i][-1] + f(i+1,i) ))
dp[i][j] = res
return res
def solve():
global n,arr,dp
dp = [[-1 for _ in range(1001)] for j in range(1001)]
n = int(input())
arr = []
for _ in range(n) :
arr.append( list(map(float,input().split())) )
arr.sort( key = lambda x : x[2])
print(f(0,-1))
solve()
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |